Hierarchical Matching of Non-rigid Shapes
نویسندگان
چکیده
Detecting similarity between non-rigid shapes is one of the fundamental problems in computer vision. While rigid alignment can be parameterized using a small number of unknowns representing rotations, reflections and translations, non-rigid alignment does not have this advantage. The majority of the methods addressing this problem boil down to a minimization of a distortion measure. The complexity of a matching process is exponential by nature, but it can be heuristically reduced to a quadratic or even linear for shapes which are smooth two-manifolds. Here we model shapes using both local and global structures, and provide a hierarchical framework for the quadratic matching problem.
منابع مشابه
Non-rigid Shape Correspondence Using Pointwise Surface Descriptors and Metric Structures
Finding a correspondence between two non-rigid shapes is one of the cornerstone problems in the field of three-dimensional shape processing. We describe a framework for marker-less non-rigid shape correspondence, based on matching intrinsic invariant surface descriptors, and the metric structures of the shapes. The matching task is formulated as a quadratic optimization problem that can be used...
متن کاملHierarchical Framework for Shape Correspondence
Detecting similarity between non-rigid shapes is one of the fundamental problems in computer vision. In order to measure the similarity the shapes must first be aligned. As opposite to rigid alignment that can be parameterized using a small number of unknowns representing rotations, reflections and translations, non-rigid alignment is not easily parameterized. Majority of the methods addressing...
متن کاملRegularized Partial Matching of Rigid Shapes
Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show a rigorous approach allowing to find matching par...
متن کاملPartial matching of rigid shapes
Matching of rigid shapes is an important problem in numerous applications across the boundary of computer vision, pattern recognition and computer graphics communities. A particularly challenging setting of this problem is partial matching, where the two shapes are dissimilar in general, but have significant similar parts. In this paper, we show an approach allowing to find matching parts of ri...
متن کاملMatching 3D Shapes Using 2D Conformal Representations
Matching 3D shapes is a fundamental problem in Medical Imaging with many applications including, but not limited to, shape deformation analysis, tracking etc. Matching 3D shapes poses a computationally challenging task. The problem is especially hard when the transformation sought is diffeomorphic and non-rigid between the shapes being matched. In this paper, we propose a novel and computationa...
متن کامل